Complete graph

Results: 868



#Item
621Graph / Graph theory / Graph operations / Line graph

Preparing for the IELTS test with Holmesglen Institute of TAFE The writing component The IELTS writing test takes one hour. In this time you are required to complete two tasks. TASK ONE is a report based on some graphic

Add to Reading List

Source URL: www.world-english.org

Language: English - Date: 2012-02-08 21:00:35
622NP-complete problems / Graph coloring / Combinatorial optimization / Maximum cut / Cut / Probabilistically checkable proof / Edge coloring / NP-complete / Graph theory / Theoretical computer science / Mathematics

On Khot’s unique games conjecture

Add to Reading List

Source URL: www.ams.org

Language: English - Date: 2012-05-01 11:13:39
623Signal processing / Statistical inference / Applied mathematics / NP-complete problems / Graph theory / Theoretical computer science / Mathematics / Estimation theory

A Consistent Histogram Estimator for Exchangeable Graph Models

Add to Reading List

Source URL: jmlr.org

Language: English - Date: 2014-02-17 21:47:29
624NP-complete problems / Vertex / Graph partition / Distance / Connected component / Matching / Minimum spanning tree / Connectivity / Graph theory / Theoretical computer science / Mathematics

Mizan: A System for Dynamic Load Balancing in Large-scale Graph Processing Zuhair Khayyat‡ Karim Awara‡

Add to Reading List

Source URL: www.cs.cornell.edu

Language: English - Date: 2013-06-23 20:27:26
625NP-complete problems / Graph connectivity / Combinatorial optimization / Graph coloring / Neighbourhood / Connected component / Tree / Graph / Vertex / Graph theory / Mathematics / Theoretical computer science

Optimizing Graph Algorithms on Pregel-like Systems ∗ Semih Salihoglu

Add to Reading List

Source URL: ilpubs.stanford.edu

Language: English - Date: 2014-01-10 18:29:06
626Spanning tree / Graphical models / Probability theory / Minimum spanning tree / NP-complete problems / Belief propagation / Tree decomposition / Connectivity / Markov random field / Graph theory / Mathematics / Theoretical computer science

IEEE TRANSACTIONS ON INFORMATION THEORY, VOL. 51, NO. 7, JULY[removed]A New Class of Upper Bounds on the Log Partition Function

Add to Reading List

Source URL: www.eecs.berkeley.edu

Language: English - Date: 2005-08-15 12:26:48
627NP-complete problems / Combinatorial optimization / Cut / Graph connectivity / Graph coloring / Connectivity / Graph partition / Graph / Maximum flow problem / Graph theory / Mathematics / Theoretical computer science

TALIP ad-1/2 pg. vertical 4-C

Add to Reading List

Source URL: www.cs.berkeley.edu

Language: English - Date: 2012-09-07 04:32:07
628NP-complete problems / Linear algebra / Matrix theory / Permutations / Computational complexity theory / Matching / Computing the permanent / Permanent / Time complexity / Mathematics / Theoretical computer science / Graph theory

Algorithmica[removed]: 392–401 Algorithmica © 1996 Springer-Verlag New York Inc.

Add to Reading List

Source URL: www.cs.berkeley.edu

Language: English - Date: 2004-09-11 20:54:49
629Combinatorial optimization / NP-complete problems / Cut / Graph connectivity / Graph partition / Connectivity / Matching / Minimum cut / Randomized algorithm / Graph theory / Mathematics / Theoretical computer science

Graph Partitioning using Single Commodity Flows Satish Rao Umesh Vazirani University of Waterloo,

Add to Reading List

Source URL: www.cs.berkeley.edu

Language: English - Date: 2007-01-02 19:10:42
630Independent set / Graph operations / Graph / Maximal independent set / Clique problem / Graph theory / NP-complete problems / Clique

Data Mining and Knowledge Discovery in Dynamic Networks Panos M. Pardalos Center for Applied Optimization Dept. of Industrial & Systems Engineering

Add to Reading List

Source URL: www.eecs.harvard.edu

Language: English - Date: 2006-10-30 15:12:10
UPDATE